Budapest

Results: 6082



#Item
531

The square root phenomenon in planar graphs Dániel Marx1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2013-10-26 13:22:00
    532

    Minimum sum multicoloring on the edges of trees Dániel Marx Budapest University of Technology and Economics Workshop on Approximation and Online Algorithms

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2007-10-29 10:18:34
      533

      University of Florida • Mathematics Department 15th Erd˝os Colloquium by J´anos Pintz∗ MTA R´enyi Institute, Budapest, Hungary

      Add to Reading List

      Source URL: www.math.ufl.edu

      Language: English - Date: 2015-03-09 11:38:48
        534

        Every graph is easy or hard: dichotomy theorems for graph problems Dániel Marx1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2015-06-10 14:23:18
          535

          IAA-00-IAATHE DISCOVERY OF ETI AS A HIGH-CONSEQUENCE, LOW-PROBABILITY EVENT Iván Almár1 and Jill Tarter2 1. Konkoly Observatory, Budapest, Hungary 2. SETI Institute, Mountain View, California, USA

          Add to Reading List

          Source URL: avsport.org

          Language: English - Date: 2013-08-31 14:06:05
            536

            Precoloring extension on chordal graphs ´ Daniel Marx Budapest University of Technology and Economics

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2007-10-29 10:15:27
              537

              Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2007-10-29 10:15:11
                538

                CTCFinder: Efficient module finder in directed, undirected and weighted networks. Abel D, Palla G, Farkas I J, Derenyi I, Pollner P, Vicsek T. Eotvos University and Hung. Acad. of Sci., Budapest, Hungary Networks

                Add to Reading List

                Source URL: www.ifr.ac.uk

                Language: English - Date: 2008-05-01 05:36:56
                  539

                  S P E C I A L F E AT U R E : I N N O V E I T © Martin Fisch EIT Governing Board chairman Peter Olesen spoke to Portal at INNOVEIT 2015 in Budapest, Hungary, on how the organisation will create new KICs in

                  Add to Reading List

                  Source URL: horizon2020projects.com

                  Language: English - Date: 2016-02-01 18:37:05
                    540

                    List edge multicoloring in bounded cyclicity graphs Dániel Marx Budapest University of Technology and Economics

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2007-10-29 10:12:15
                      UPDATE